<title>Bessie 的体重问题</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;algorithm&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-cp">#define MAXH 45005</span>
<span class="pl-cp">#define MAXN 505</span>
<span class="pl-kt">int</span> <span class="pl-n">s</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">],</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">MAXH</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;weight.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;weight.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
	<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d %d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
	<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">s</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
	<span class="pl-p">}</span>
	<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-n">h</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&gt;=</span> <span class="pl-n">s</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span> <span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">){</span>
			<span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">],</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-o">-</span><span class="pl-n">s</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span><span class="pl-o">+</span><span class="pl-n">s</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
		<span class="pl-p">}</span>
	<span class="pl-p">}</span>
	<span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">h</span><span class="pl-p">]);</span>
	
	<span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>